Reversible Uni cation Based Machine Translation

In this paper it will be shown how uniication grammars can be used to build a reversible machine translation system. Uniication grammars are often used to deene the relation between strings and meaning representations in a declarative way. Such grammars are sometimes used in a bidirectional way, thus the same grammar is used for both parsing and generation. In this paper I will show how to use bidirectional uniication grammars to deene reversible relations between language dependent meaning representations. Furthermore it is shown how to obtain a completely reversible MT system using a series of (bidirectional) uniication grammars.